Quasi-newton Methods for Nonlinear Least Squares Focusing on Curvatures
نویسنده
چکیده
Most existing quasi-Newton methods for nonlinear least squares problems incorporate both linear and nonlinear information in the secant update. These methods exhibit good theoretical properties, but are not especially accurate in practice. The objective of this paper is to propose quasi-Newton methods that only update the nonlinearities. We show two advantages of such updates. First, fast convergence is established for well-conditioned problems by interpolating also the previous step, thereby allowing diierent Broyden parameters in each iteration. Secondly, high accuracy is also possible to achieve for certain diicult problems. For example, ill-conditioned problems and problems with large curvature in the tangent space. Numerical results for artiicial problems and standard test problems are presented and discussed.
منابع مشابه
Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis
We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...
متن کاملA secant method for nonlinear least-squares minimization
Quasi-Newton methods have played a prominent role, over many years, in the design of effective practical methods for the numerical solution of nonlinear minimization problems and in multi-dimensional zero-finding. There is a wide literature outlining the properties of these methods and illustrating their performance [e.g., [8]]. In addition, most modern optimization libraries house a quasi-Newt...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملPreconditioning issues in the numerical solution of nonlinear equations and nonlinear least squares
Second order methods for optimization call for the solution of sequences of linear systems. In this survey we will discuss several issues related to the preconditioning of such sequences. Covered topics include both techniques for building updates of factorized preconditioners and quasi-Newton approaches. Sequences of unsymmetric linear systems arising in NewtonKrylov methods will be considered...
متن کاملAffine scaling methods for image deblurring problems
Blur in images can be removed by solving a series of box-constrained least-squares problems. In this paper, we compare two recent approaches for solving these problems using affine-scaling methods. Both approaches aim at solving a nonlinear system arising from the Karush-Kuhn-Tucker condition. One approach is to identify the active set and update the inactive components of the iterates by using...
متن کامل